Checking Models, Proving Programs, and Testing Systems
نویسنده
چکیده
We are all faced up to a flowering of concepts and methods in the area of software verification and validation, due to significant advances in the domain. This paper considers the main terms and expressions currently in use on the subjects of model, specification, program, system, proof, checking, testing. Some analysis of the use and combination of these terms is sketched, pointing out some confusions and discrepancies. This leads to a plea for clarification of the taxonomy and terminology. The aim is a better identification of the general concepts and activities in the area, and the development of some uniform basic terminology helping communication and cooperation among the scientific and industrial actors.
منابع مشابه
Verifying Haskell programs by combining testing, model checking and interactive theorem proving
We propose a program verification method that combines random testing, model checking and interactive theorem proving. Testing and model checking are used for debugging programs and specifications before a costly interactive proof attempt. During proof development, testing and model checking quickly eliminate false conjectures and generate counterexamples which help to correct them. With an int...
متن کاملSymbolic Bounded Conformance Checking of Model Programs
Model programs are high-level behavioral specifications typically representing Abstract State Machines or ASMs. Conformance checking of model programs is the problem of deciding if the set of traces allowed by one model program forms a subset of the set of traces allowed by another model program. This is a foundational problem in the context of model-based testing, where one model program corre...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملSpecification-based Verification of Incomplete Programs
Recently, formal methods like model checking or theorem proving have been considered efficient tools for software verification. However, when practically applied, those techniques suffer high complexity cost. Combining static analysis with dynamic checking to deal with this problem has been becoming an emerging trend, which results in the introduction of concolic testing technique and its varia...
متن کاملTwo Computer-Supported Proofs in Metric Space Topology∗
Every mathematician will agree that the discovery, analysis, and communication of theorems and proofs is at the heart of his or her discipline. A number of computer programs (such as Maple or Mathematica) assist mathematicians in testing conjectures and proving certain kinds of theorems, typically identities involving rational functions or trigonometric polynomials. These systems, however, were...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011